The M/G/1 FIFO Queue with Several Customer Classes
نویسندگان
چکیده
In this note we present short derivations of the joint queue length distribution in the M/G/1 queue with several classes of customers and FIFO service discipline.
منابع مشابه
The Multi-class Fifo M/g/1 Queue with Exponential Working Vacations
We consider a stationary multi-class FIFO M/G/1 queue with exponential working vacations, where a server works at two different processing rates. There are K classes of customers, and the arrival rates and the distributions of the amount of service requirements of arriving customers depend on both their customer classes and the server state. When the system becomes empty, the server takes a wor...
متن کاملAn M/G/1 Retrial Queue with Priority, Balking and Feedback Customers
We consider an M/G/1 queue with general retrial times where the blocked customers may balk the system, or join the priority queue, or enter the orbit. As soon as a customer is served, he will decide either to leave the system or join the orbit for another service in accordance with an FCFS discipline. We assume that only the customer at the head of the orbit is allowed to retry for service. We ...
متن کاملOptimization of M G 1 Queue with Vacation (TECHNICAL NOTE)
This paper reports on the minimization of the average waiting time of the customers in the M/G/1 queue with vacation. Explicit formula for the unknown service parameter of a particular customer has been obtained by considering the exhaustive service discipline in the case of multi-user with unlimited service system. Moreover, results in case of partially gated and gated service disciplines unde...
متن کاملMultiple class G-networks with iterated deletions
We present a new type of multiclass generalized networks of queues with a steady-state product form solution. At its arrival into a queue, a negative customer (or a signal) starts an iteration. At each step of the iteration, a customer is deleted according to a probability which may depend on the type of customer. The iteration stops when the deletion fails. We study networks with multiple clas...
متن کاملAN EXTREMAL PROPERTY OF FIFO DISCIPLINE IN G/IFR/l QUEUES
In a recent paper by Shanthikumar and Sumita (1987), it is conjectured that the ergodic sojourn time of a customer in G /IFR/1 queues is minimized by FIFO (first in, first out) discipline in the sense of increasing and convex ordering. This paper shows that their conjecture is true. In fact, FIFO discipline minimizes E[~Z'=l f( iO(k) aO(k)] for any non-decreasing and convex function f, where N ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Queueing Syst.
دوره 45 شماره
صفحات -
تاریخ انتشار 2003